Resource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures
نویسنده
چکیده
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞; the study of resource-bounded measure theory with respect to a nonuniform underlying measure was recently initiated by Breutzmann and Lutz [1]. In this paper we prove a series of fundamental results on the role of nonuniform measures in resource-bounded measure theory. These results provide new tools for analyzing and constructing martingales and, in particular, offer new insight into the compressibility characterization of randomness given recently by Buhrman and Longpré [2]. We give several new characterizations of resource-bounded randomness with respect to an underlying measure μ: the first identifies those martingales whose rate of success is asymptotically optimal on the given sequence; the second identifies martingales which induce a maximal compression of the sequence; the third is a (nontrivial) extension of the compressibility characterization to the nonuniform case. In addition we prove several technical results of independent interest, including an extension to resource-bounded measure of the classical theorem of Kakutani on the equivalence of product measures; this answers an open question in [1].
منابع مشابه
Kobayashi compressibility
Kobayashi [Kob81] introduced a uniform notion of compressibility of infinite binary sequences X in terms of relative Turing computations with sub-linear use of the oracle. Given f : N → N we say that X is f -compressible if there exists Y such that for each n we can uniformly compute X ↾n from oracle Y ↾ f (n). Kobayashi compressibility has remained a relatively obscure notion, with the excepti...
متن کاملOn Resource-Bounded Versions of the van Lambalgen Theorem
The van Lambalgen theorem is a surprising result in algorithmic information theory concerning the symmetry of relative randomness. It establishes that for any pair of infinite sequences A and B, B is Martin-Löf random and A is Martin-Löf random relative to B if and only if the interleaved sequence A ⊎ B is Martin-Löf random. This implies that A is relative random to B if and only if B is random...
متن کاملResource bounded randomness and computational complexity
The following is a survey of resource bounded randomness concepts and their relations to each other. Further, we introduce several new resource bounded randomness concepts corresponding to the classical randomness concepts, and show that the notion of polynomial time bounded Ko randomness is independent of the notions of polynomial time bounded Lutz, Schnorr and Kurtz randomness. Lutz has conje...
متن کاملRandomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets
We show that the question of whether the p-tt-complete or p-T -complete sets for the deterministic time classes E and EXP have measure 0 in these classes in the sense of Lutz's resource-bounded measure cannot be decided by relativizable techniques. On the other hand, we obtain the following absolute results if we bound the norm, i.e., the number of oracle queries of the reductions: For r = tt; ...
متن کاملThe pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
We continue an investigation into resource-bounded Kolmogorov complexity [ABK06], which highlights the close connections between circuit complexity and Levin’s time-bounded Kolmogorov complexity measure Kt (and other measures with a similar flavor), and also exploits derandomization techniques to provide new insights regarding Kolmogorov complexity. The Kolmogorov measures that have been introd...
متن کامل